Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge
نویسندگان
چکیده
Let G be a 3-connected graph on more than 4 vertices. We show that every depth-first-search tree of G contains a contractible edge. Moreover, we show that if G is 3-regular or does not have two disjoint pairs of adjacent degree-3 vertices, every spanning tree of G contains a contractible edge.
منابع مشابه
More on foxes
An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting e is k-connected. Generalizing earlier results on 3-contractible edges in spanning trees of 3-connected graphs, we prove that (except for the graphs Kk+1 if k ∈ {1, 2}) (a) every spanning tree of a k-connected triangle free graph has two k-contractible edges, (b) every spanning tree of a k-...
متن کاملContractible Cliques in k-Connected Graphs
Kawarabayashi proved that for any integer k ≥ 4, every k-connected graph contains two triangles sharing an edge, or admits a k-contractible edge, or admits a k-contractible triangle. This implies Thomassen’s result that every triangle-free k-connected graph contains a k-contractible edge. In this paper, we extend Kawarabayashi’s technique and prove a more general result concerning k-contractibl...
متن کاملA Theorem About a Contractible and Light Edge
In 1955 Kotzig proved that every planar 3-connected graph contains an edge such that sum of degrees of its endvertices is at most 13. Moreover, if the graph does not contain 3-vertices, then this sum is at most 11. Such an edge is called light. The well-known result of Steinitz that the 3-connected planar graphs are precisely the skeletons of 3-polytopes, gives an additional trump to Kotzig’s t...
متن کاملMaximum matchings in 3-connected graphs contain contractible edges
In this paper it is shovm that every maximum matching in a 3-connectccl graph, other than ](4, contains at least one contractible edge. In the case of a. perfect ma.tching, those graphs in \vhich there exists a perfect matching containing precisely one contractible edge arc characterized.
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 72 شماره
صفحات -
تاریخ انتشار 2013